منابع مشابه
New Doubling Spanners: Better and Simpler
In a seminal STOC’95 paper, Arya et al. conjectured that spanners for low-dimensional Euclidean spaces with constant maximum degree, hop-diameter O(logn) and lightness O(logn) (i.e., weight O(logn)· w(MST)) can be constructed in O(n logn) time. This conjecture, which became a central open question in this area, was resolved in the affirmative by Elkin and Solomon in STOC’13 (even for doubling m...
متن کاملFault-Tolerant Spanners for Doubling Metrics: Better and Simpler
In STOC’95 Arya et al. [2] conjectured that for any constant dimensional n-point Euclidean space, a (1+ǫ)-spanner with constant degree, diameter O(log n) and weight O(log n) ·ω(MST ) can be built in O(n · log n) time. Recently Elkin and Solomon [10] (technical report, April 2012) proved this conjecture of Arya et al. in the affirmative. In fact, the proof of [10] is more general in two ways. Fi...
متن کاملDegree Four Plane Spanners: Simpler and Better
Let P be a set of n points embedded in the plane, and let C be the complete Euclidean graph whose point-set is P. Each edge in C between two points p, q is realized as the line segment [pq], and is assigned a weight equal to the Euclidean distance |pq|. In this paper, we show how to construct inO(n lgn) time a plane spanner of C of maximum degree at most 4 and of stretch factor at most 20. This...
متن کاملGreedy spanners are optimal in doubling metrics
We show that the greedy spanner algorithm constructs a (1+ )-spanner of weight −O(d)w(MST) for a point set in metrics of doubling dimension d, resolving an open problem posed by Gottlieb [11]. Our result generalizes the result by Narasimhan and Smid [15] who showed that a point set in d-dimension Euclidean space has a (1+ )-spanner of weight at most −O(d)w(MST). Our proof only uses the packing ...
متن کاملThe Simpler the Better
We built three different AI models to predict the category (frozen, liquid or none) based on polarimetric radar variables. One model was a long-shot model for the purpose of winning the competition (it didn’t). The second was a complex black box model to represent the average learnability of the dataset. The third was a simple, human-readable model that would perform similarly to the above two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2015
ISSN: 0097-5397,1095-7111
DOI: 10.1137/130930984